package pat;

import java.util.Arrays;
import java.util.Scanner;
import java.util.Vector;

public class PerfectSequence {

	public static void main(String[] args) {
		Vector v=new Vector();
		Scanner s=new Scanner(System.in);
		int m=s.nextInt();
		int p=s.nextInt();
		int a[]=new int[m];
		for(int i=0;i<m;i++)
		{
			a[i]=s.nextInt();
		}
		System.out.print(doJob(a,p));
		
	}

	private static int doJob(int[] a, int p) {

		Arrays.sort(a);
		for(int i=0;i<a.length;i++)
		{
			if(a[a.length-1]<a[i]*p)
			{
				return a.length-i;
			}
		}
		return 0;
	}

}
